Competitive learning of monotone Boolean functions
نویسنده
چکیده
We apply competitive analysis onto the problem of minimizing the number of queries to an oracle to completely reconstruct a given monotone Boolean function. Besides lower and upper bounds on the competitivity we determine optimal deterministic online algorithms for the smallest problem instances.
منابع مشابه
2 Learning Monotone Boolean Functions
Last time we finished the discussion about KM algorithm and its application. We also covered sparse Fourier representations and k-juntas of parities. In the end we started to talk about learning monotone Boolean functions and influence of such functions. Today We will first finish discussion about learning monotone Boolean functions. Then we will also talk about learning k-juntas of halfspaces....
متن کاملFunction Evaluation Via Linear Programming in the Priced Information Model
Wedetermine the complexity of evaluatingmonotone Boolean functions in a variant of the decision tree model introduced in [Charikar et al. 2002]. In thismodel, reading different variables can incur different costs, and competitive analysis is employed to evaluate the performance of the algorithms. It is known that for a monotone Boolean function f, the size of the largest certificate, aka PROOF ...
متن کاملCompetitive Boolean Function Evaluation: Beyond Monotonicity, and the Symmetric Case
We study the extremal competitive ratio of Boolean function evaluation. We provide the first non-trivial lower and upper bounds for classes of Boolean functions which are not included in the class of monotone Boolean functions. For the particular case of symmetric functions our bounds are matching and we exactly characterize the best possible competitiveness achievable by a deterministic algori...
متن کاملOn Learning Monotone Boolean Functions
Abstract We consider the problem of learning monotone Boolean functions over under the uniform distribution. Specifically, given a polynomial number of uniform random samples for an unknown monotone Boolean function , and given polynomial computing time, we would like to approximate as well as possible. We describe a simple algorithm that we prove achieves error at most , improving on the previ...
متن کاملAlmost all monotone Boolean functions are polynomially learnable using membership queries
We consider exact learning or identification of monotone Boolean functions by only using membership queries. It is shown that almost all monotone Boolean functions are polynomially identifiable in the input number of variables as well as the output being the sum of the sizes of the CNF and DNF representations. 2001 Elsevier Science B.V. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1401.8135 شماره
صفحات -
تاریخ انتشار 2012